Algebraic Logic Functional language - определение. Что такое Algebraic Logic Functional language
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое Algebraic Logic Functional language - определение

PROGRAMMING LANGUAGE WHICH COMBINES FUNCTIONAL AND LOGIC PROGRAMMING TECHNIQUES
Algebraic logic functional programming language; Algebraic Logic Functional (programming language)

Algebraic Logic Functional language      
<language> (ALF) A language by Rudolf Opalla <opalla@julien.informatik.uni-dortmund.de> which combines functional programming and logic programming techniques. ALF is based on Horn clause logic with equality which consists of predicates and Horn clauses for {logic programming}, and functions and equations for {functional programming}. Any functional expression can be used in a goal literal and arbitrary predicates can occur in conditions of equations. ALF uses narrowing and rewriting. ALF includes a compiler to Warren Abstract Machine code and run-time support. ftp://ftp.germany.eu.net/pub/programming/languages/LogicFunctional. ["The Implementation of the Functional-Logic Language ALF", M. Hanus and A. Schwab]. (1992-10-08)
Algebraic Logic Functional programming language         
Algebraic Logic Functional programming language, also known as ALF, is a programming language which combines functional and logic programming techniques. Its foundation is Horn clause logic with equality which consists of predicates and Horn clauses for logic programming, and functions and equations for functional programming.
Journal of Logical and Algebraic Methods in Programming         
JOURNAL
Journal on Logic Programming; The Journal of Logic Programming; The Journal on Logic Programming; J. Log. Prog.; J. Log. Program.; Journal of Logic Programming; Journal of Logic and Algebraic Programming; The Journal of Logic and Algebraic Programming; J. Log. Algebr. Methods Program.; J Log Algebr Methods Program; J. Log. Algebr. Program.; J Log Algebr Program; The Journal of Logical and Algebraic Methods in Programming; Journal of Logical & Algebraic Methods in Programming; Journal of Logic & Algebraic Programming; The Journal of Logic & Algebraic Programming; The Journal of Logical & Algebraic Methods in Programming; J Log Program
The Journal of Logical and Algebraic Methods in Programming is a peer-reviewed scientific journal established in 1984. It was originally titled The Journal of Logic Programming; in 2001 it was renamed The Journal of Logic and Algebraic Programming, and in 2014 it obtained its current title.

Википедия

Algebraic Logic Functional programming language

Algebraic Logic Functional programming language, also known as ALF, is a programming language which combines functional and logic programming techniques. Its foundation is Horn clause logic with equality which consists of predicates and Horn clauses for logic programming, and functions and equations for functional programming.

ALF was designed to be genuine integration of both programming paradigms, and thus any functional expression can be used in a goal literal and arbitrary predicates can occur in conditions of equations. ALF's operational semantics is based on the resolution rule to solve literals and narrowing to evaluate functional expressions. In order to reduce the number of possible narrowing steps, a leftmost-innermost basic narrowing strategy is used which, it is claimed, can be efficiently implemented. Terms are simplified by rewriting before a narrowing step is applied and equations are rejected if the two sides have different constructors at the top. Rewriting and rejection are supposed to result in a large reduction of the search tree and produce an operational semantics that is more efficient than Prolog's resolution strategy. Similarly to Prolog, ALF uses a backtracking strategy corresponding to a depth-first search in the derivation tree.

The ALF system was designed to be an efficient implementation of the combination of resolution, narrowing, rewriting, and rejection. ALF programs are compiled into instructions of an abstract machine. The abstract machine is based on the Warren Abstract Machine (WAM) with several extensions to implement narrowing and rewriting. In the current ALF implementation programs of this abstract machine are executed by an emulator written in C.

In the Carnegie Mellon University Artificial Intelligence Repository, ALF is included as an AI programming language, in particular as a functional/logic programming language Prolog implementation. A user manual describing the language and the use of the system is available. The ALF System runs under Unix and is available under a custom proprietary software license that grants the right to use for "evaluation, research and teaching purposes" but not commercial or military use.